Every finite non-solvable group admits an oriented regular representation

نویسندگان

  • Joy Morris
  • Pablo Spiga
چکیده

In this paper we give a partial answer to a 1980 question of Lazslo Babai: “Which [finite] groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely characterize all finite groups that can be generated by at most three elements, according to whether or not they admit ORRs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms

Tutte’s 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that, if a regular graph of valency at least four admits a solvable group of automorphisms acting transitively on its vertex set and edge set, then it admits a nowhere-zero 3-flow.

متن کامل

Algorithms and Topology of Cayley Graphs for Groups

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. A comparison with automatic groups is given. Another charact...

متن کامل

Groups all of whose undirected Cayley graphs are determined by their spectra

The adjacency spectrum Spec(Γ) of a graph Γ is the multiset of eigenvalues of its adjacency matrix. Two graphs with the same spectrum are called cospectral. A graph Γ is “determined by its spectrum” (DS for short) if every graph cospectral to it is in fact isomorphic to it. A group is DS if all of its Cayley graphs are DS. A group G is Cay-DS if every two cospectral Cayley graphs of G are isomo...

متن کامل

Classification of finite groups that admit an oriented regular representation

This is the third, and last, of a series of papers dealing with oriented regular representations. Here we complete the classification of finite groups that admit an oriented regular representation (or ORR for short), and give a complete answer to a 1980 question of László Babai: “Which [finite] groups admit an oriented graph as a DRR?” It is easy to see and well-understood that generalised dihe...

متن کامل

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 126  شماره 

صفحات  -

تاریخ انتشار 2017